On the Optimal Selection and Integration of Batteries in DC Grids through a Mixed-Integer Quadratic Convex Formulation

نویسندگان

چکیده

This paper deals with the problem of optimal selection and location batteries in DC distribution grids by proposing a new mixed-integer convex model. The exact nonlinear model is transformed into quadratic (MIQC) approximating product among voltages power balance equations as hyperplane. most important characteristic our proposal that MIQC formulations ensure global optimum reaching via branch & bound methods programming since each combination binary variables generates node optimization subproblem. formulation objective function associated minimization energy losses for daily operation scenario considering high renewable penetration. Numerical simulations show effectiveness proposed to reach when compared 21-node test feeder. All validations are carried out GAMS software.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex formulations for optimal selection of controlled variables and measurements using Mixed Integer Quadratic Programming

The appropriate selection of controlled variables is important for operating a process optimally in the presence of disturbances. Self-optimizing control provides a mathematical framework for selecting the controlled variables as combinations of measurements, c = Hy, with the aim to minimize the steady state loss from optimal operation. In this paper, we present (i) a convex formulation to find...

متن کامل

reflections on taught courses of the iranian ma program in english translation: a mixed-methods study

the issue of curriculum and syllabus evaluation and revision has been in center of attention right from when curriculum came into attention of educational institutions. thus everywhere in the world in educational institutions curricula and syllabi are evaluated and revised based on the goals, the needs, existing content, etc.. in iran any curriculum is designed in a committee of specialists and...

Unbounded convex sets for non-convex mixed-integer quadratic programming

This paper introduces a fundamental family of unbounded convex sets that arises in the context of non-convex mixed-integer quadratic programming. It is shown that any mixed-integer quadratic program with linear constraints can be reduced to the minimisation of a linear function over a set in the family. Some fundamental properties of the convex sets are derived, along with connections to some o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2021

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics10192339